Binomial edge ideals of cographs

نویسندگان

چکیده

We determine the Castelnuovo-Mumford regularity of binomial edge ideals complement reducible graphs (cographs). For cographs with $n$ vertices maximum grows as $2n/3$. also bound by graph theoretic invariants and construct a family counterexamples to conjecture Hibi Matsuda.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binomial edge ideals and rational normal scrolls

‎Let $X=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n\‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...

متن کامل

Binomial Edge Ideals of Graphs

We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...

متن کامل

binomial edge ideals and rational normal scrolls

‎let $x=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the hankel matrix of size $2times n$ and let $g$ be a closed graph on the vertex set $[n].$ we study the binomial ideal $i_gsubset k[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $x$ which correspond to the edges of $g.$ we show that...

متن کامل

Binomial Edge Ideals with Quadratic Gröbner Bases

We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.

متن کامل

Regularity Bounds for Binomial Edge Ideals

We show that the Castelnuovo–Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista De La Union Matematica Argentina

سال: 2022

ISSN: ['0041-6932', '1669-9637']

DOI: https://doi.org/10.33044/revuma.2247